Negation Switching Equivalence in Signed Graphs

Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8]. We consider only finite, simple graphs free from self-loops

Total Minimal Dominating Signed Graph

Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is positive (friendly, like, etc.) or negative (hostile, dislike, etc.). Such a network S is called a signed graph. Signed graphs are much studied in literature because of their extensive use in modeling a variety socio-psychological process and also because of their interesting connections with many classical mathematical systems

Smarandachely t-path step signed graphs

Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed graphs

The H-Line Signed Graph of a Signed Graph

For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates

Switching Equivalence in Symmetric n-Sigraphs-V

Introducing a new notion S-antipodal symmetric n-sigraph of a symmetric n-sigraph and its properties are obtained. Also giving the relation between antipodal symmetric n-sigraphs and S-antipodal symmetric n-sigraphs. Further, discussing structural characterization of S-antipodal symmetric n-sigraphs

A Note On Line Graphs

In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems

Atom-bond-connectivity index of certain graphs

The ABC index is one of the most applicable topological graph indices and several properties of it has been studied already due to its extensive chemical applications. Several variants of it have also been defined and used for several reasons. In this paper, we calculate the atom-bond connectivity index of some derived graphs such as double graphs, subdivision graphs and complements of some standard graphs.Publisher's Versio

t-Path Sigraphs

[[abstract]]Given a sigraph S and a positive integer t, the t-path sigraph (S)(subscript t) of S is formed by taking a copy of the vertex set V (S) of S, joining two vertices u and v in the copy by a single edge e=uv whenever there is a u-v path of length t in S and then by defining its sign to be-whenever in every u-v path of length t in S all the edges are negative. In this paper, we introduce a variation of the concept of t-path sigraphs studied above. The motivation stems naturally from one's mathematically inquisitiveness as to ask why not define the sign of an edge e=uv in (S) (subscript t) as the product of the signs of the vertices u and v in S. It is shown that for any sigraph S, its t-path sigraph (S) (subscript t) is balanced. We then give structural characterization of t-path sigraphs. Further, in this paper we characterize sigraphs which are switching equivalent to their 2(3)-path sigraphs

S-Antipodal Signed Graphs

[[abstract]]In this paper we introduced a new notion S-antipodal signed graph of a signed graph and its properties are obtained. Also we give the re- lation between antipodal signed graphs and S-antipodal signed graphs. Further, we discuss structural characterization of S-antipodal signed graphs

Note on Path Signed Graphs

Abstract Data in the social sciences can often modeled using signed graphs, graphs where every edge has a sign + or −, or marked graphs, graphs where every vertex has a sign + or −. The path graph P k (G) of a graph G is obtained by representing the paths P k in G by vertices whenever the corresponding paths P k in G from a path P k+1 or a cycle C k . In this note, we introduce a natural extension of the notion of path graphs to the realm of signed graphs. It is shown that for any signed graph S, P k (S) is balanced. The concept of a line signed graph is generalized to that of a path signed graphs. Further, in this note we discuss the structural characterization of path signed graphs. Also, we characterize signed graphs which are switching equivalent to their path signed graphs P 3 (S) (P 4 (S)). 2000 Mathematics Subject Classification : 05C 2